Efficient computation of stochastic cell-size transient dynamics
نویسندگان
چکیده
منابع مشابه
Efficient Computation of Stochastic Complexity
Stochastic complexity of a data set is defined as the shortest possible code length for the data obtainable by using some fixed set of models. This measure is of great theoretical and practical importance as a tool for tasks such as model selection or data clustering. Unfortunately, computing the modern version of stochastic complexity, defined as the Normalized Maximum Likelihood (NML) criteri...
متن کاملHybrid systems approach to modeling stochastic dynamics of cell size
A ubiquitous feature of all living cells is their growth over time followed by division into two daughter cells. How a population of genetically identical cells maintains size homeostasis, i.e., a narrow distribution of cell size, is an intriguing fundamental problem. We model size using a stochastic hybrid system, where a cell grows exponentially over time and probabilistic division events are...
متن کاملEfficient Computation Based on Stochastic Spikes
The speed and reliability of mammalian perception indicate that cortical computations can rely on very few action potentials per involved neuron. Together with the stochasticity of single-spike events in cortex, this appears to imply that large populations of redundant neurons are needed for rapid computations with action potentials. Here we demonstrate that very fast and precise computations c...
متن کاملEfficient Term Size Computation for Granularity Control
Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of optimizations which includes granularity control and recursion elimination. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predeñned) predicates which traverse the terms involved. We propose a techniq...
متن کاملEfficient Algorithms for Transient Analysis of Stochastic Fluid Flow Models
We derive several algorithms for the busy period distribution of the canonical Markovian fluid flow model. One of them is similar to the Latouche–Ramaswami algorithm for quasi-birth–death models and is shown to be quadratically convergent. These algorithms significantly increase the efficiency of the matrix-geometric procedures developed earlier by the authors for the transient and steady-state...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2019
ISSN: 1471-2105
DOI: 10.1186/s12859-019-3213-7